Playing Games with Theorem Provers

The disciplines of Computer Game Playing and Automated Theorem Proving have a lot in common and insights to share. From huge search spaces to heuristics and evaluation function, from learning to domain analysis to competition, both of these areas of Artificial Intelligence have much to gain from each other. This paper describes the use of a logic based language to describe games and a game playing system, named Monster, built from an automated theorem prover.